Topological Properties of Secure Wireless Sensor Networks Under the $q$ -Composite Key Predistribution Scheme With Unreliable Links

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological Properties of Wireless Sensor Networks Under the Q-Composite Key Predistribution Scheme With Unreliable Links (CMU-CyLab-14-002)

The seminal q-composite key predistribution scheme[3] (IEEE S&P; 2003) is used prevalently for secure communica-tions in large-scale wireless sensor networks (WSNs). Yağan [12](IEEE IT 2012) and we [15] (IEEE ISIT 2013) explore topologicalproperties of WSNs employing the q-composite scheme in thecase of q = 1 with unreliable communication links modeledas independent on/of...

متن کامل

Key Predistribution Scheme for Wireless Sensor Networks with Higher Connectivity

In wireless sensor network (WSN), preditibution of cryptographic keys is possibly the most practical approach to perfect network communications. In this paper, we propose a new secret key predistribution scheme to achieve a higher connectivity in WSN. For this we combine a random key predistribution scheme and hash chain method based on the prior knowledge of sensor node deployment. The propose...

متن کامل

An Efficient Pairwise Key Predistribution Scheme for Wireless Sensor Networks

Key management plays fundamental role in research on security service in wireless sensor networks (WSNs). However, due to the resource constraints, establishing pairwise keys in WSNs is not a trivial tasks. Several exiting key management schemes have been proposed in literature to establish pairwise keys between sensor nodes, but they either can not offer strong resilience against node capture ...

متن کامل

Two Improvements of Random Key Predistribution for Wireless Sensor Networks

Key distribution is of a critical importance to security of wireless sensor networks (WSNs). Random key predistribution is an acknowledged approach to the key distribution problem. In this paper, we propose and analyze two novel improvements that enhance security provided by the random key predistribution schemes. The first improvement exploits limited length collisions in secure hash functions...

متن کامل

Efficient Key Predistribution for Grid-Based Wireless Sensor Networks

In this paper we propose a new key predistribution scheme for wireless sensor networks in which the sensors are arranged in a square grid. We describe how Costas arrays can be used for key predistribution in these networks, then define distinct difference configurations, a more general structure that provides a flexible choice of parameters in such schemes. We give examples of distinct differen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE/ACM Transactions on Networking

سال: 2017

ISSN: 1063-6692,1558-2566

DOI: 10.1109/tnet.2017.2653109